Thanks for the video! Even though this is a relatively simple algorithm, the only way to really understand it is to go step by step on a toy problem, like you did. Excellent job!
Pretty good explanation. I think the hard to get part, for me, is the best path to the root concept. But if one works through some trees, I think it becomes more clear.
In the branch to the right, alpha is already set to 6. This means that the v should be set to 6 initially in the max-nodes, not -infinity as is shown in the video. If you find this hard, look up the minmax algorithm. Alpha-beta is built upon minmax
I found this very helpful especially once the values of alpha and beta weren't just infinity and -infinity! I kept pausing the video and working through a couple steps then playing the video to see if I did them right, which really helped me grasp when you change the values of alpha and beta. Great video although it did take me a couple watches to fully get it!
Some important notes: 1) only in a Max node can update the corresponding alpha, so does Min for beta.2) v can only be returned up to its parent3) alpha and beta can only be passed down from its parent4) cut the current node from the tree whenever alpha >= beta
Congratulations, very well explained. It was very usefull for me.I agree there is not much tutorials which explain this concept as u do.Again, congratulations and thank you man.
I was having trouble understanding what exactly the alpha and beta parameters were supposed to mean. The books I had read were very confusing about this. This video made it crystal-clear.
Very well detailed explanation of alpha beta pruning given Sir! You are really a good teacher, saved me from this confusing algo! I was tearing my hair getting to understand this, until i came over to your video. Thank you so much!
While examining the children of a maximizer, if v of maximizer > beta, prune the rest of the children.While examining the children of a minimizer, if v of minimizer < alpha, prune the rest of the children.